One-way and two-way cost allocation in hub network problems
نویسندگان
چکیده
We study hub problems where a set of nodes send and receive data from each other. In order to reduce costs, the nodes use a network with a given set of hubs. We address the cost sharing aspect by assuming that nodes are only interested in either sending or receiving data, but not both (one-way flow) or that nodes are interested in both sending and receiving data (two-way flow). In both cases, we study the nonemptiness of the core and the Shapley value of the corresponding cost game.
منابع مشابه
Hierarchical Facility Location and Hub Network Problems: A literature review
In this paper, a complete review of published researches about hierarchical facility location and hub network problems is presented. Hierarchical network is a system where facilities with different service levels interact in a top-down way or vice versa. In Hierarchical systems, service levels are composed of different facilities. Published papers from (1970) to (2015) have been studied and a c...
متن کاملGenetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure
A p-hub center network design problem is definition of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first...
متن کاملDesign of a Bi-Objective Capacitated Single-Allocation Incomplete Hub Network Considering an Elastic Demand
This paper presents a bi-objective capacitated hub arc location problem with single assignment for designing a metro network with an elastic demand. In the literature, it is widely supposed that the network created with the hub nodes is complete. In this paper, this assumption is relaxed. Moreover, in most hub location problems, the demand is assumed to be static and independent of the location...
متن کاملA Multi-Level Capacity Approach to the Hub and Spoke Network
The existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. Although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...
متن کاملمساله پوشش هاب تک تخصیصی بر روی شبکه ستارهای؛ مدلبندی، خطیسازی و یافتن کران مناسب برای آن
The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...
متن کامل